Solution: Boolean algebra is based on binary number system. It therefore comprises only 2 bits : 0 and 1. Hence, only two values are applicable to Boolean algebra.

Solution: Boolean Algebra can only be used with the binary number system. Boolean deals with only two values 0 and 1. In Boolean System, if the result is tautology it returns 1 otherwise 0.

Solution: The symbol + is also called as the OR operator. It is used for logical addition. It follows the law of binary addition.

Solution: The NOT operator has the highest precedence. It is denoted by ! or – sign. Further, AND (.) operations are performed and then the OR terms are evaluated.

Solution: In Boolean Algebra, complement of a number is given the highest precedence. Therefore, complement which is denoted by the ‘ (apostrophe) symbol is evaluated first.

Solution: The first and second option describes the commutative law. The fourth option holds true since if x=1, then x’=0, and x+x’=1. Third option is incorrect because on multiplication of a boolean value with its complement the result will always be 0.

Solution: It will always return the same value X. Since, boolean deals with only two numbers 0 and 1, if we add 0+0, the answer is 0. Similarly, if we add 1+1 the answer is 1.

Solution: The involution law states that the complement of complement of a number is the number itself. The third option justifies the statement. Thus, (x’)’=x.

Solution: Claude E Shannon suggested the use of Boolean in relay switching circuits. George Boole, a mathematician introduced it for simplifying representations and manipulation of propositional logic.

Solution: The Boolean functions are represented using the truth tables. Truth tables represent the tautology and fallacy for terms.